Relaxation Runge--Kutta Methods: Conservation and Stability for Inner-Product Norms
نویسندگان
چکیده
منابع مشابه
Stability of Runge–Kutta–Nyström methods
In this paper, a general and detailed study of linear stability of Runge–Kutta–Nyström (RKN) methods is given. In the case that arbitrarily stiff problems are integrated, we establish a condition that RKN methods must satisfy so that a uniform bound for stability can be achieved. This condition is not satisfied by any method in the literature. Therefore, a stable method is constructed and some ...
متن کاملLinear Stability of Partitioned Runge-Kutta Methods
We study the linear stability of partitioned Runge–Kutta (PRK) methods applied to linear separable Hamiltonian ODEs and to the semidiscretization of certain Hamiltonian PDEs. We extend the] by presenting simplified expressions of the trace of the stability matrix, tr Ms, for the Lobatto IIIA–IIIB family of symplectic PRK methods. By making the connection to Padé approximants and continued fract...
متن کاملRunge - Kutta Methods page RK 1 Runge - Kutta Methods
Literature For a great deal of information on Runge-Kutta methods consult J.C. Butcher, Numerical Methods for Ordinary Differential Equations, second edition, Wiley and Sons, 2008, ISBN 9780470723357. That book also has a good introduction to linear multistep methods. In these notes we refer to this books simply as Butcher. The notes were written independently of the book which accounts for som...
متن کاملAsymptotic Stability of Runge-kutta Methods for the Pantograph Equations
This paper considers the asymptotic stability analysis of both exact and numerical solutions of the following neutral delay differential equation with pantograph delay. ⎧⎨ ⎩ x′(t) +Bx(t) + Cx′(qt) +Dx(qt) = 0, t > 0, x(0) = x0, where B,C,D ∈ Cd×d, q ∈ (0, 1), and B is regular. After transforming the above equation to non-automatic neutral equation with constant delay, we determine sufficient co...
متن کاملCentral Runge-Kutta Schemes for Conservation Laws
In this work, a new formulation for central schemes based on staggered grids is proposed. It is based on a novel approach, in which first a time discretization is carried out, followed by the space discretization. The schemes obtained in this fashion have a simpler structure than previous central schemes. For high order schemes, this simplification results in higher computational efficiency. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2019
ISSN: 0036-1429,1095-7170
DOI: 10.1137/19m1263662